|
In number theory, primes in arithmetic progression are any sequence of at least three prime numbers that are consecutive terms in an arithmetic progression. For example, the sequence of primes (3, 7, 11), which is given by for . According to the Green–Tao theorem, there exist arbitrarily long sequences of primes in arithmetic progression. Sometimes the phrase may also be used about primes which belong to an arithmetic progression which also contains composite numbers. For example, it can be used about primes in an arithmetic progression of the form , where ''a'' and ''b'' are coprime, which according to Dirichlet's theorem on arithmetic progressions contains infinitely many primes, along with infinitely many composites. For integer ''k'' ≥ 3, an AP-''k'' (also called PAP-''k'') is any sequence of ''k'' primes in arithmetic progression. An AP-''k'' can be written as ''k'' primes of the form ''a''·''n'' + ''b'', for fixed integers ''a'' (called the common difference) and ''b'', and ''k'' consecutive integer values of ''n''. An AP-''k'' is usually expressed with ''n'' = 0 to ''k'' − 1. This can always be achieved by defining ''b'' to be the first prime in the arithmetic progression. == Properties == Any given arithmetic progression of primes has a finite length. In 2004, Ben J. Green and Terence Tao settled an old conjecture by proving the Green–Tao theorem: The primes contain arbitrarily long arithmetic progressions. It follows immediately that there are infinitely many AP-''k'' for any ''k''. If an AP-''k'' does not begin with the prime ''k'', then the common difference is a multiple of the primorial ''k''# = 2·3·5·...·''j'', where ''j'' is the largest prime ≤ ''k''. :''Proof'': Let the AP-''k'' be ''a''·''n'' + ''b'' for ''k'' consecutive values of ''n''. If a prime ''p'' does not divide ''a'', then modular arithmetic says that ''p'' will divide every ''pth term of the arithmetic progression. (From H.J. Weber, Cor.10 in ``Exceptional Prime Number Twins, Triplets and Multiplets," arXiv:1102.3075(). See also Theor.2.3 in ``Regularities of Twin, Triplet and Multiplet Prime Numbers," arXiv:1103.0447(),Global J.P.A.Math 8(2012), in press.) If the AP is prime for ''k'' consecutive values, then ''a'' must therefore be divisible by all primes ''p'' ≤ ''k''. This also shows that an AP with common difference ''a'' cannot contain more consecutive prime terms than the value of the smallest prime that does not divide ''a''. If ''k'' is prime then an AP-''k'' can begin with ''k'' and have a common difference which is only a multiple of (''k''−1)# instead of ''k''#. (From H. J. Weber, ``Less Regular Exceptional and Repeating Prime Number Multiplets," arXiv:1105.4092(), Sect.3.) For example, the AP-3 with primes and common difference 2# = 2, or the AP-5 with primes and common difference 4# = 6. It is conjectured that such examples exist for all primes ''k''. , the largest prime for which this is confirmed is ''k'' = 17, for this AP-17 found by Phil Carmody in 2001: :17 + 11387819007325752·13#·n, for ''n'' = 0 to 16. It follows from widely believed conjectures, such as Dickson's conjecture and some variants of the prime k-tuple conjecture, that if ''p'' > 2 is the smallest prime not dividing ''a'', then there are infinitely many AP-(''p''−1) with common difference ''a''. For example, 5 is the smallest prime not dividing 6, so there is expected to be infinitely many AP-4 with common difference 6, which is called a sexy prime quadruplet. When ''a'' = 2, ''p'' = 3, it is the twin prime conjecture, with an "AP-2" of 2 primes (''b'', ''b'' + 2). 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Primes in arithmetic progression」の詳細全文を読む スポンサード リンク
|